Single-facility huff location problems on networks
نویسندگان
چکیده
منابع مشابه
p-facility Huff location problem on networks
The p-facility Hu location problem aims at locating facilities on a competitive environment so as to maximize the market share. While it has been deeply studied in the eld of continuous location, in this paper we study the p-facility Hu location problem on networks formulated as a Mixed Integer Nonlinear Programming problem that can be solved by a branch and bound algorithm. We propose two appr...
متن کاملUnreliable point facility location problems on networks
In this paper we study facility location problems on graphs under the most common criteria, such as, median, center and centdian, but we incorporate in the objective function some reliability aspects. Assuming that facilities may become unavailable with a certain probability, the problem consists of locating facilities minimizing the overall or the maximum expected service cost in the long run,...
متن کاملNew Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks
We consider the single facility ordered median location problem with uncertainty in the parameters (weights) defining the objective function. We study two cases. In the first case the uncertain weights belong to a region with a finite number of extreme points, and in the second case they must also satisfy some order constraints and belong to some box, (convex case). To deal with the uncertainty...
متن کاملEffectiveness-equity models for facility location problems on tree networks
We propose models to investigate effectiveness-equity tradeoffs in tree network facility location problems. We use the commonly used median objective as a measure of effectiveness, and the Gini index as a measure of (in)equity, and formulate bicriteria problems involving these objectives. We develop procedures to identify an efficient set of solutions to these problems, analyze the complexity o...
متن کاملExtensive facility location problems on networks with equity measures
This paper deals with the problem of locating path-shaped facilities of unrestricted length on networks. We consider as objective functions measures conceptually related to the variability of the distribution of the distances from the demandpoints to a facility.We study the following problems: locating a path which minimizes the range, that is, the difference between the maximum and the minimum...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2013
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-013-1445-x